Label Rectification Learning through Kernel Extreme Learning Machine

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple kernel extreme learning machine

Extreme learning machine (ELM) has been an important research topic over the last decade due to its high efficiency, easy-implementation, unification of classification and regression, and unification of binary and multi-class learning tasks. Though integrating these advantages, existing ELM algorithms pay little attention to optimizing the choice of kernels, which is indeed crucial to the perfo...

متن کامل

Extreme Learning Machine for Multi-Label Classification

Xia Sun 1,*, Jingting Xu 1, Changmeng Jiang 1, Jun Feng 1, Su-Shing Chen 2 and Feijuan He 3 1 School of Information Science and Technology, Northwest University, Xi’an 710069, China; [email protected] (J.X.); [email protected] (C.J.); [email protected] (J.F.) 2 Computer Information Science and Engineering, University of Florida, Gainesville, FL 32608, USA; [email protected] 3 Department o...

متن کامل

Deformed Kernel Based Extreme Learning Machine

The extreme learning machine (ELM) is a newly emerging supervised learning method. In order to use the information provided by unlabeled samples and improve the performance of the ELM, we deformed the kernel in the ELM by modeling the marginal distribution with the graph Laplacian, which is built with both labeled and unlabeled samples. We further approximated the deformed kernel by means of ra...

متن کامل

On the kernel Extreme Learning Machine classifier

In this paper, we discuss the connection of the kernel versions of the ELM classifier with infinite Single-hidden Layer Feedforward Neural networks and show that the original ELM kernel definition can be adopted for the calculation of the ELM kernel matrix for two of the most common activation functions, i.e., the RBF and the sigmoid functions. In addition, we show that a low-rank decomposition...

متن کامل

On the kernel Extreme Learning Machine speedup

In this paper, we describe an approximate method for reducing the time and memory complexities of the kernel Extreme Learning Machine variants. We show that, by adopting a Nyström-based kernel ELM matrix approximation, we can define an ELM space exploiting properties of the kernel ELM space that can be subsequently used to apply several optimization schemes proposed in the literature for ELM ne...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2021

ISSN: 1530-8677,1530-8669

DOI: 10.1155/2021/6669081